Philosophy Dictionary of ArgumentsHome
| |||
|
| |||
| Lambda abstraction: Lambda abstraction is a way of defining functions without using a function name. It is a key concept in functional programming. See also Lambda calculus._____________Annotation: The above characterizations of concepts are neither definitions nor exhausting presentations of problems related to them. Instead, they are intended to give a short introduction to the contributions below. – Lexicon of Arguments. | |||
| Author | Concept | Summary/Quotes | Sources |
|---|---|---|---|
|
Arnim von Stechow on Lambda-Abstraction - Dictionary of Arguments
48 Lambda notation: [λx: f. g]. - E.g. if g is a sentence: - the function f, such that for any x that satisfies f : f (x) = 1 if g is true, 0 if g is false. 161 Lambda abstraction: returns the value sequence of a function. Lambda-bound variables: have no reference. - The variable in the lambda operator is neither bound nor free. >Lambda calculus, >Variables, >Bound variable, >Free variable, >Reference, >Operators, >Functions, >Value progression._____________Explanation of symbols: Roman numerals indicate the source, arabic numerals indicate the page number. The corresponding books are indicated on the right hand side. ((s)…): Comment by the sender of the contribution. Translations: Dictionary of Arguments The note [Concept/Author], [Author1]Vs[Author2] or [Author]Vs[term] resp. "problem:"/"solution:", "old:"/"new:" and "thesis:" is an addition from the Dictionary of Arguments. If a German edition is specified, the page numbers refer to this edition. |
A. von Stechow I Arnim von Stechow Schritte zur Satzsemantik www.sfs.uniï·"tuebingen.de/~astechow/Aufsaetze/Schritte.pdf (26.06.2006) |
||
> Counter arguments against Stechow
> Counter arguments in relation to Lambda-Abstraction
Ed. Martin Schulz, access date 2024-04-29